Region Encoding Helps Evolutionary Computation Evolve Faster: A New Solution Encoding Scheme in Particle Swarm for Large-Scale Optimization
نویسندگان
چکیده
In the last decade, many evolutionary computation (EC) algorithms with diversity enhancement have been proposed to solve large-scale optimization problems in big data era. Among them, social learning particle swarm (SLPSO) has shown good performance. However, as SLPSO uses different guidance information for particles maintain diversity, it often results slow convergence speed. Therefore, this article proposes a new region encoding scheme (RES) extend solution representation from single point region, which can help EC evolve faster. The RES is generic and applied SLPSO. Based on RES, novel adaptive search (ARS) designed one hand keep of other accelerate speed, forming ARS (SLPSO-ARS). SLPSO-ARS, each encoded so that some best (e.g., top P) carry out better solutions near their current positions. strategy offers greater chance discover nearby optimal helps speed whole population. Moreover, radius adaptively controlled based information. Comprehensive experiments all both IEEE Congress Evolutionary Computation 2010 (CEC 2010) 2013 2013) competitions are conducted validate effectiveness efficiency SLPSO-ARS investigate its important parameters components. experimental show achieve generally performance than compared algorithms.
منابع مشابه
A new security proof for FMNV continuous non-malleable encoding scheme
A non-malleable code is a variant of an encoding scheme which is resilient to tampering attacks. The main idea behind non-malleable coding is that the adversary should not be able to obtain any valuable information about the message. Non-malleable codes are used in tamper-resilient cryptography and protecting memories against tampering attacks. Many different types of non-malleability have alre...
متن کاملA New Shuffled Sub-swarm Particle Swarm Optimization Algorithm for Speech Enhancement
In this paper, we propose a novel algorithm to enhance the noisy speech in the framework of dual-channel speech enhancement. The new method is a hybrid optimization algorithm, which employs the combination of the conventional θ-PSO and the shuffled sub-swarms particle optimization (SSPSO) technique. It is known that the θ-PSO algorithm has better optimization performance than standard PSO al...
متن کاملA Particle Swarm Optimization Algorithm for Mixed-Variable Nonlinear Problems
Many engineering design problems involve a combination of both continuous anddiscrete variables. However, the number of studies scarcely exceeds a few on mixed-variableproblems. In this research Particle Swarm Optimization (PSO) algorithm is employed to solve mixedvariablenonlinear problems. PSO is an efficient method of dealing with nonlinear and non-convexoptimization problems. In this paper,...
متن کاملAn improved particle swarm optimization with a new swap operator for team formation problem
Formation of effective teams of experts has played a crucial role in successful projects especially in social networks. In this paper, a new particle swarm optimization (PSO) algorithm is proposed for solving a team formation optimization problem by minimizing the communication cost among experts. The proposed algorithm is called by improved particle optimization with new swap operator (IPSONSO...
متن کاملA limited memory adaptive trust-region approach for large-scale unconstrained optimization
This study concerns with a trust-region-based method for solving unconstrained optimization problems. The approach takes the advantages of the compact limited memory BFGS updating formula together with an appropriate adaptive radius strategy. In our approach, the adaptive technique leads us to decrease the number of subproblems solving, while utilizing the structure of limited memory quasi-Newt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2021
ISSN: ['1941-0026', '1089-778X']
DOI: https://doi.org/10.1109/tevc.2021.3065659